Disambiguation of Proper Names Using Finite-State Local Grammars
نویسندگان
چکیده
Like common noun phrases, proper names contain ambiguous conjoined phrases that make their delimitation and classification difficult in text. This paper presents a finite-state approach to the disambiguation of Portuguese candidate proper name strings containing the coordinating conjunction e (and). In such name strings, the conjunction can denote a relation between two independent names, but it can also be part of a multiword proper name. The coordination of multiword independent names may involve ellipsis of some lexical constituents, which causes additional difficulties to proper name identification and classification.
منابع مشابه
A Local Grammar-based Approach to Recognizing of Proper Names in Korean Texts
We present an LO-based approach to recognizing of Proper Names in Korean texts. Local grammars (LGs) are constructed by examining specific syntactic contexts of lexical elements, given that the general syntactic rules, independent from lexical items, cannot provide accurate analyses. The LGs will be represented under the form of Finite State Automata (FSA) in our system. So far as we do not hav...
متن کاملبهبود صحت ابهامزدایی نام نویسنده با استفاده از خوشهبندی تجمّعی
Today, digital libraries are important academic resources including millions of citations and bibliographic essential information such as titles, author's names and location of publications. From the view of knowledge accumulation management, the ability to search fast, accurate, desired contents, has a great importance. The complexity and similarity in these resources cause many challenges and...
متن کاملIntersection Optimization is NP-Complete
Finite state methods for natural language processing often require the construction and the intersection of several automata. In this paper we investigate the question of determining the best order in which these intersections should be performed. We take as an example lexical disambiguation in polarity grammars. We show that there is no efficient way to minimize the state complexity of these i...
متن کاملSyntactic Analysis by Local Grammars Automata: an Efficient Algorithm
The description of the constraints restricting words' combinations in specific contexts provides helpful grammars for reducing the number of ambiguities of lemmatized texts. These grammars allow to easily eliminate many of the ambiguities without even using complex general syntactic rules involving a lexicon-grammar. Local grammars can be represented in a very natural way by finite state automa...
متن کاملSchematic Finite-State Intersection Parsing
The framework of Finite-State Intersection Grammars employs a parsing technique according to which several finite-state automata are intersected to determine the output automaton. Implementation of the intersection parser has turned out to be a difficult task. Several problems in efficiency arise when disambiguation choices are based on long contexts with many don’t cares. We are concerned with...
متن کامل